Mini-Project II Monte Carlo Localisation for mobile robots
نویسندگان
چکیده
The localisation is not a trivial problem of mobile robotics. The robot must localise itself, having merely a map of the environment and sensor readings. This is a base knowledge that robot must possess in order to be able to complete higher level tasks like path planning. The Monte Carlo Localisation (MCL) is a probabilistic algorithm successfully applied in many mobile robot systems. The core of the system that implements the MCL algorithm is the “T1000” Java-written robot application platform which cooperates with the “Saphira” robot control system developed at SRI International’s Artificial Intelligence Center. T1000 is a client application communicating via TCP/IP network with a Windows/Linux server for Saphira, what enables running and testing several robot applications at the same time. Thanks to affine transformation of robot’s sensor measurements, the algorithm does not have to be synchronised with incoming sensor data, and allows processing several measurements at a time. Moreover, they can be processed at any convenient time, what simplifies using any preselection algorithm. In addition, the improved particles’ initialisation can also reduce the number of particles without decreasing the effectiveness of the basic MCL algorithm. Even though the system was not tested yet on real robots, the experiments with the “Pioneer” robot simulator are promising, and it seems that the system is comparable to the original MCL software attached to Saphira.
منابع مشابه
Hierarchical Image-based Localisation for Mobile Robots with Monte-Carlo Localisation
This paper extends our previous works on image-based localisation for mobile robot. The image-based localisation consists in matching the current view experienced by the robot with the reference views stored in the visual memory of the robot. The original idea was to use the Fourier components as signatures for the omnidirectional images acquired by the robot. The extensions proposed in this pa...
متن کاملHierarchical Monte-Carlo Localisation Balances Precision and Speed
Localisation is a fundamental problem for mobile robots. In dynamic environments (robotic soccer) it is imperative that the process be very efficient. Techniques like Monte-Carlo Localisation or Markov Models have been shown to be effective in dealing with partial recognition of landmarks, errors in odometry and the kidnap problem. But they are particularly CPU intensive. However, many times de...
متن کاملImage-based Monte Carlo localisation with omnidirectional images
Monte Carlo localisation generally requires a metrical map of the environment to calculate a robots position from the posterior probability density of a set of weighted samples. Image-based localisation, which matches a robots current view of the environment with reference views, fails in environments with perceptual aliasing. The method we present in this paper is experimentally demonstrated t...
متن کاملCollaborative Multi-Robot Monte Carlo Localization in Assistant Robots
This paper presents an algorithm for collaborative mobile robot localization based on probabilistic methods (Monte Carlo localization) used in assistant robots. When a root detects another in the same environment, a probabilistic method is used to synchronize each robot’s belief. As a result, the robots localize themselves faster and maintain higher accuracy. The technique has been implemented ...
متن کاملEstimating Reliability in Mobile ad-hoc Networks Based on Monte Carlo Simulation (TECHNICAL NOTE)
Each system has its own definition of reliability. Reliability in mobile ad-hoc networks (MANET) could be interpreted as, the probability of reaching a message from a source node to destination, successfully. The variability and volatility of the MANET configuration makes typical reliability methods (e.g. reliability block diagram) inappropriate. It is because, no single structure or configurat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004